Inductive Simplicity and the Matrix∗
نویسندگان
چکیده
In certain statistical learning problems, a policy of choosing simpler rules that account fairly well for data is likely to have less error on new cases than a policy of choosing complex rules that have less error on the data. The relevant kind of simplicity is not to be measured in terms of the number of parameters needed to specify a given member of a class of rules but might be measured in terms of the VC dimension of such a class. The rationale for using simplicity so measured can be extended to allow simplicity to decide among empirically equivalent hypotheses. The extended rationale provides reasons of simplicity to reject certain sorts of philosophical skepticism.
منابع مشابه
A Block-Wise random sampling approach: Compressed sensing problem
The focus of this paper is to consider the compressed sensing problem. It is stated that the compressed sensing theory, under certain conditions, helps relax the Nyquist sampling theory and takes smaller samples. One of the important tasks in this theory is to carefully design measurement matrix (sampling operator). Most existing methods in the literature attempt to optimize a randomly initiali...
متن کاملDiscovering Patterns by Searching for Simplicity
I discuss the use of Kolmogorov complexity and Bayes’ theorem in Solomonoff’s inductive method to explicate a generM concept of simplicity. This makes it possible to understand how the search for simple, i.e., short, computational descriptions of (empirical) data yields to the discovery of patterns, and hence more probable predictions. I show how the simplicity bias of Langley’s BACON.2 and Tha...
متن کاملA Class of Simple C-algebras with Stable Rank One
Abstract. We study the limits of inductive sequences (Ai, φi) where each Ai is a direct sum of full matrix algebras over compact metric spaces and each partial map of φi is diagonal. We give a new characterisation of simplicity for such algebras, and apply it to prove that the said algebras have stable rank one whenever they are simple and unital. Significantly, our results do not require any d...
متن کاملUsing Exciting and Spectral Envelope Information and Matrix Quantization for Improvement of the Speaker Verification Systems
Speaker verification from talking a few words of sentences has many applications. Many methods as DTW, HMM, VQ and MQ can be used for speaker verification. We applied MQ for its precise, reliable and robust performance with computational simplicity. We also used pitch frequency and log gain contour for further improvement of the system performance.
متن کاملUsing Exciting and Spectral Envelope Information and Matrix Quantization for Improvement of the Speaker Verification Systems
Speaker verification from talking a few words of sentences has many applications. Many methods as DTW, HMM, VQ and MQ can be used for speaker verification. We applied MQ for its precise, reliable and robust performance with computational simplicity. We also used pitch frequency and log gain contour for further improvement of the system performance.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003